The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
نویسندگان
چکیده
منابع مشابه
The edge-disjoint path problem on random graphs by message-passing
We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be pe...
متن کاملOn the maximum disjoint paths problem on edge-colored graphs
Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint unicolor paths in an edge-colored graph. We show the NP-hardness and the approximability of the problem, and both approximation and exact algorithms are proposed. Since short paths are much more significant in SNA, we also study the length-bounded version of the problem, in...
متن کاملEdge-disjoint Hamilton cycles in random graphs
We show that provided log n/n ≤ p ≤ 1 − n−1/4 log n we can with high probability find a collection of bδ(G)/2c edge-disjoint Hamilton cycles in G ∼ Gn,p, plus an additional edge-disjoint matching of size bn/2c if δ(G) is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich.
متن کاملA Message Passing Model for Communication on Random Regular Graphs
| Randomized routing strategies are applied to avoid worst-case communication patterns on communication networks used for parallel computers. Instead of a randomized routing strategy on a regular communication network, the random-ization of the network itself is investigated in this paper. A model to describe properties of random regular graphs is presented. With the results of the model it is ...
متن کاملA Message Passing Algorithm for the Problem of Path Packing in Graphs
We consider the problem of packing node-disjoint directed paths in a directed graph. We consider a variant of this problem where each path starts within a fixed subset of root nodes, subject to a given bound on the length of paths. This problem is motivated by the socalled kidney exchange problem, but has potential other applications and is interesting in its own right. We propose a new algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0145222